The Densest Lattice in Twenty-four Dimensions
نویسنده
چکیده
In this research announcement we outline the methods used in our recent proof that the Leech lattice is the unique densest lattice in R24. Complete details will appear elsewhere, but here we illustrate our techniques by applying them to the case of lattice packings in R2, and we discuss the obstacles that arise in higher dimensions.
منابع مشابه
Efficient linear programming algorithm to generate the densest lattice sphere packings.
Finding the densest sphere packing in d-dimensional Euclidean space R(d) is an outstanding fundamental problem with relevance in many fields, including the ground states of molecular systems, colloidal crystal structures, coding theory, discrete geometry, number theory, and biological systems. Numerically generating the densest sphere packings becomes very challenging in high dimensions due to ...
متن کاملA method for dense packing discovery
The problem of packing a system of particles as densely as possible is foundational in the field of discrete geometry and is a powerful model in the material and biological sciences. As packing problems retreat from the reach of solution by analytic constructions, the importance of an efficient numerical method for conducting de novo (from-scratch) searches for dense packings becomes crucial. I...
متن کاملAn Inequality on the Coding Gain of Densest Lattice Packings in Successive Dimensions
A lower bound of the form ( 2n n+1 ) 1 n γ n−1 n n−1 is derived on the coding gain γn of the densest n-dimensional (n-D) lattice(s). The bound is obtained based on constructing an n-D lattice which consists of parallel layers. Each layer is selected as a translated version of a densest (n − 1)-D lattice. The relative positioning of the layers is adjusted to make the coding gain as large as poss...
متن کاملStatistical mechanics of the lattice sphere packing problem.
We present an efficient Monte Carlo method for the lattice sphere packing problem in d dimensions. We use this method to numerically discover de novo the densest lattice sphere packing in dimensions 9 through 20. Our method goes beyond previous methods, not only in exploring higher dimensions but also in shedding light on the statistical mechanics underlying the problem in question. We observe ...
متن کاملOn extremal lattices in jump dimensions
Let (L,Q) be an even unimodular lattice, so L is a free Z-module of rank n, and Q : L → Z a positive definite regular integral quadratic form. Then L can be embedded into Euclidean n-space (R, (, )) with bilinear form defined by (x, y) := Q(x + y) − Q(x) − Q(y) and L defines a lattice sphere packing, whose density measures its error correcting properties. One of the main goals in lattice theory...
متن کامل